Packet loss optimization in router forwarding tasks based on the particle swarm algorithm

Software-defined networks (SDNs) are computer networks where parameters and devices are configured by software. Recently, artificial intelligence aspects have been used for SDN programs for various applications, including packet classification and forwarding according to the quality of service (QoS) requirements. The main problem is that when packets from different applications pass through computer networks, they have different QoS criteria. To meet the requirements of packets, routers classify these packets, add them to multiple weighting queue systems, and forward them according to their priorities. Multiple queue systems in routers usually use a class-based weighted round-robin (CBWRR) scheduling algorithm with pre-configured fixed weights for each priority queue. The problem is that the intensity of traffic in general and of each packet class occasionally changes. Therefore, in this work, we suggest using the particle swarm optimization algorithm to find the optimal weights for the weighted fair round-robin algorithm (WFRR) by considering the variable densities of the traffic. This work presents a framework to simulate router operations by determining the weights and schedule packets and forwarding them. The proposed algorithm to optimize the weights is compared with the conventional WFRR algorithm, and the results show that the particle swarm optimization for the weighted round-robin algorithm is more efficient than WFRR, especially in high-intensity traffic. Moreover, the average packet-loss ratio does not exceed 7%, and the proposed algorithms are better than the conventional CBWRR algorithm and the related work results

Human Computer Interface for Wheelchair Movement

This paper aims to develop a technique for helping disabled people elderly with physical disability, such as those who are unable to move hands and cannot speak howover, by using a computer vision; real time video and interaction between human and computer where these combinations provide a promising solution to assist the disabled people. The main objective of the work is to design a project as a wheelchair which contains two wheel drives. This project is based on real time video for detecting and tracking human face. The proposed design is multi speed based on pulse width modulation(PWM), technique. This project is a fast response to detect and track face direction with four operations movement (left, right, forward and stop). These operations are based on a code written in MATLAB environment and Arduino IDE environment. The proposed system uses an ATmega328microcontroller (Arduino UNO board)

A proposed Method for Scale drawing Calculating depending on Line detector and Length detector

A scale drawing is a significant tool in many fields such as geography, mathematics, and astronomy research as it has a variety of applications, including Google maps. We present a new way to benefit from the scale drawing in soccer image. When the distance of the camera is uncertain, the scale drawing can be used to determine the relationship between the ball and players to estimate the ball size and to determine the zoom up and zoom in. The research findings indicated that the proposed work was succeeded to compute the scale drawing in two ways: line detector and length detector with approximate results to the desired results

CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm

In Round-Robin Scheduling, the time quantum is fixed and processes are scheduled such that no process uses CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes will not be tolerated in an interactive environment. If the time quantum is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughputs. In this study, we propose a priority Round-Robin algorithm with dynamic quantum time (PDQT). The algorithm used the old fixed quantum time to generate new one for each process depending on its priority. The simple Round-Robin algorithm has been improved by about 20%. By controlling quantum time, we experience fewer context switches and shorter waiting and turnaround times, thereby obtaining higher throughput

CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms

In Round-Robin Scheduling, the time quantum is fixed and processes are scheduled such that no process uses CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes will not be tolerated in an interactive environment. If the time quantum is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughputs. Round Robin scheduling algorithm is the most suitable choice for time shared system but not for soft real time systems due to a large turnaround time, large waiting time and high number of context switches. The choice of the quantum time in RR is the optimal solution for the problem of large turnaround and waiting time with RR. In this study, we propose a priority algorithm with dynamic quantum time (PDQT), to improve the work of RR by improving the concept of Improved Round Robin with varying time quantum (IRRVQ). The proposed algorithm gave results better than RR and IRRVQ in terms of minimizing the number of context switches, average waiting time, average turnaround time, design and analysis. The simple Round-Robin algorithm has been improved by about 40%. By controlling quantum time according to the priorities and burst times of the processes, we experience fewer context switches and shorter waiting and turnaround times, thereby obtaining higher throughpu

Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms

The queue size distribution and average waiting time for a time-shared system using round-robin (RR) scheduling, with and without overhead, are determined. In this study, the incoming processes are prioritized, and dynamic quantum times are assigned depending on the level of priority. With these parameters, RR versus priority dynamic quantum time round robin scheduling algorithm is analyzed to explore the effect of changing the quantum time of processes and determine the optimum context switches, turnaround time, and waiting time

SARS-CoV-2 vaccination modelling for safe surgery to save lives: data from an international prospective cohort study

Background: Preoperative SARS-CoV-2 vaccination could support safer elective surgery. Vaccine numbers are limited so this study aimed to inform their prioritization by modelling. Methods: The primary outcome was the number needed to vaccinate (NNV) to prevent one COVID-19-related death in 1 year. NNVs were based on postoperative SARS-CoV-2 rates and mortality in an international cohort study (surgical patients), and community SARS-CoV-2 incidence and case fatality data (general population). NNV estimates were stratified by age (18-49, 50-69, 70 or more years) and type of surgery. Best- and worst-case scenarios were used to describe uncertainty. Results: NNVs were more favourable in surgical patients than the general population. The most favourable NNVs were in patients aged 70 years or more needing cancer surgery (351; best case 196, worst case 816) or non-cancer surgery (733; best case 407, worst case 1664). Both exceeded the NNV in the general population (1840; best case 1196, worst case 3066). NNVs for surgical patients remained favourable at a range of SARS-CoV-2 incidence rates in sensitivity analysis modelling. Globally, prioritizing preoperative vaccination of patients needing elective surgery ahead of the general population could prevent an additional 58 687 (best case 115 007, worst case 20 177) COVID-19-related deaths in 1 year. Conclusion: As global roll out of SARS-CoV-2 vaccination proceeds, patients needing elective surgery should be prioritized ahead of the general population